Computational Geometry Provides Techniques for Approximately Solving the p-Median Problem
ثبت نشده
چکیده
منابع مشابه
An Efficient Hybrid Metaheuristic for Capacitated p-Median Problem
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...
متن کاملA numerical technique for solving a class of 2D variational problems using Legendre spectral method
An effective numerical method based on Legendre polynomials is proposed for the solution of a class of variational problems with suitable boundary conditions. The Ritz spectral method is used for finding the approximate solution of the problem. By utilizing the Ritz method, the given nonlinear variational problem reduces to the problem of solving a system of algebraic equations. The advantage o...
متن کامل2-Median Problems in Tree Networks
Facility Location Problems have a great significance for allocating resources efficiently in a network. The interaction mainly involves a price which depends on the distances between the objects and the order of significance of the objects(clients). The applications of such problems are immense in many application areas such as medical and transportation. In this project, we consider the p-medi...
متن کاملElastic Behavior of Functionally Graded Two Tangled Circles Chamber
This paper presents the numerical elastic solution for a real problem, functionally graded chamber of hydraulic gear pumps under internal pressure. Because of the similarity and complexity for the considering geometry, a bipolar cylindrical coordinate system is used to extract the governing equations. The material properties are considered to vary along the two tangled circles with a power-law ...
متن کاملA novel computational procedure based on league championship algorithm for solving an inverse heat conduction problem
Inverse heat conduction problems, which are one of the most important groups of problems, are often ill-posed and complicated problems, and their optimization process has lots of local extrema. This paper provides a novel computational procedure based on finite differences method and league championship algorithm to solve a one-dimensional inverse heat conduction problem. At the beginning, we u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001